A Parallel Reduct Algorithm Based On Extension Matrix
نویسنده
چکیده
In this paper, on the basis of studying the limitations of the basic rough set model, we present a general rough set model, which is based on a family set of tolerance relations which is based on a family set of tolerance relations instead of equivalence relations between objects. The model inherits most of the characteristics of the basic model of rough set; and they also have a better effect of approximation classification. Based on this model, we propose two algorithms, one for a single processor and the other for parallel processors that will give us a near-optimal attributes reduct using concepts from extension matrix.
منابع مشابه
A Reduct Solving Parallel Algorithm Based on Relational Extension Matrix
In this paper, on the basis of studying the limitations of the basic rough set model, we present Tolerance Information Systems, which is based on a family set of tolerance relations between objects when given a set of tolerance relations. The model inherits most of the characteristics of the basic model of rough set; and they also have a better effect of approximation classification. Based on t...
متن کاملFault Detection of Bearings Using a Rule-based Classifier Ensemble and Genetic Algorithm
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works with genetic algorithm. To identify potential problems and prevent complete failure of bearings, a new method based on rule-based classifier ensemble is presented. Genetic algorithm is used for feature reduction. The generated rules of the reducts are used to build the candidate base...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملFeature ranking in rough sets
We propose a novel feature ranking technique using discernibility matrix. Discernibility matrix is used in rough set theory for reduct computation. By making use of attribute frequency information in discernibility matrix, we develop a fast feature ranking mechanism. Based on the mechanism, two heuristic reduct computation algorithms are proposed. One is for optimal reduct and the other for app...
متن کاملA Heuristic Optimal Reduct Algorithm
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it doe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006